An IWS Montgomery Modular Multiplication Algorithm
نویسندگان
چکیده
We present a new RNS modular multiplication for very large operands. The algorithm is based on Montgomery's method adapted to mixed radix, and is performed using a Residue Number System. By choosing the moduli of the RNS system reasonably large, and implementing the system on a ring of fairly simple processors, the carry-free nature of RNS arithmetic achieves an eeect corresponding to a redundant high-radix implementation. The algorithm can be implemented to run in O(n) time on O(n) processors, where n is the number of moduli in the RNS system.
منابع مشابه
An Efficient Parallel CMM-CSD Modular Exponentiation Algorithm by Using a New Modified Modular Multiplication Algorithm
This paper presents a new modified Montgomery modular multiplication algorithm based on canonical signed-digit (CSD) representation, and sliding window method. In this modified Montgomery modular multiplication algorithm, signed-digit recoding technique is used in order to increase probability of the zero bits. Also sliding window method is used in order to reduce the multiplication steps consi...
متن کاملRadix – 4 Implementation of a Montgomery Multiplier for a RSA Cryptosystem
As cryptosystems become more important to computing, so does the need to make the encryption and decryption of larger and stronger keys faster. The RSA algorithm presents one of these problems specifically in performing modular exponentiation. A popular method to implement the necessary modular multiplication and squaring required for exponentiation is the Montgomery Multiplication (MM) algorit...
متن کاملThe Montgomery Modular Inverse-Revisited
We modify an algorithm given by Kaliski to compute the Montgomery inverse of an integer modulo a prime number. We also give a new definition of the Montgomery inverse, and introduce efficient algorithms for computing the classical modular inverse, the KaliskiMontgomery inverse, and the new Montgomery inverse. The proposed algorithms are suitable for software implementations on general-purpose m...
متن کاملImplementation of Modular Exponentiation Using Montgomery Algorithms
Several algorithms for Public Key Cryptography (PKC), such as RSA, Diffie-Hellman, and Elliptic Curve Cryptography are used for secure communications. These algorithms require modular exponentiation as their basic operation. Modular exponentiation implies repeated modular multiplication which is computationally very costly as the large operands are used. Therefore computation time is very large...
متن کاملFPGA Implementation of Modified Montgomery for RSA Cryptosystem
Modular multiplication is a key operation in public key cryptosystems like RSA. Among modular multiplication methods, Montgomery modular multiplication is an efficient algorithm suitable for hardware implementation. In this paper, a Modified Montgomery Modular Multiplication design is proposed with carry save adder architecture and parallel simplified quotient computation for the next iteration...
متن کامل